Parallel Branch and Bound Skeleton Using Shared Memory

There are many combinatorial optimization problems in the world considering finding the optimal solution from finite but usually very large feasible solutions. To solve such problems, Branch and Bound (B&B) algorithms are frequently used. B&B algorithms try to avoid examining all solutions for a specified problem by discarding some obvious “bad” solutions. The problem space is divided into subspaces (branch) and a bound function is performed on each such subspace to determine whether to divide this subspace or not.